Detection and Analysis of Iterative Behavior in Parallel Applications
نویسندگان
چکیده
Many applications exhibit iterative and phase based behavior. We present an approach to detect and analyze iteration phases in applications by recording the control flow graph of the application and analyzing it for loops that represent iterations. Phases are then manually marked and performance profiles are captured in alignment with the iterations. By analyzing how profiles change between capture points, differences in execution behavior between iterations can be uncovered.
منابع مشابه
A New Iterative Algorithm for Multivalued Nonexpansive Mappping and Equlibruim Problems with Applications
In this paper, we introduce two iterative schemes by a modified Krasnoselskii-Mann algorithm for finding a common element of the set of solutions of equilibrium problems and the set of fixed points of multivalued nonexpansive mappings in Hilbert space. We prove that the sequence generated by the proposed method converges strongly to a common element of the set of solutions of equilibruim proble...
متن کاملFlow and Heat Transfer Analysis of the Sodium Alginate Conveying Copper Nanoparticles between Two Parallel Plates
In this study, the steady incompressible flow of a non-Newtonian sodium alginate (SA) fluid conveying copper nanoparticles (Cu) which flow within two vertical parallel plates is investigated by using the homotopy perturbation analytical scheme to solve the coupled nonlinear ordinary equations arising from the mechanics of the fluid. The developed analytical solutions are used to investigate the...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملProjected non-stationary simultaneous iterative methods
In this paper, we study Projected non-stationary Simultaneous It-erative Reconstruction Techniques (P-SIRT). Based on algorithmic op-erators, convergence result are adjusted with Opial’s Theorem. The advantages of P-SIRT are demonstrated on examples taken from to-mographic imaging.
متن کاملStrong convergence of modified iterative algorithm for family of asymptotically nonexpansive mappings
In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p
متن کامل